An Algorithm for Strengthening State Invariants Generated from Requirements Specifications
نویسندگان
چکیده
In earlier work, we developed a xpoint algorithm for automatically generating state invariants, properties that hold in each reachable state of a state machine model, from state-based requirements speci cations. Such invariants are useful both in validating requirements speci cations and as auxiliary lemmas in proofs that a requirements speci cation satis es other invariant properties. This paper describes a new related algorithm that strengthens state invariants generated by our initial algorithm and demonstrates the new algorithm on a simpli ed version of an automobile cruise control system. The paper concludes by describing how the two algorithms were used to generate state invariants from a requirements speci cation of a cryptographic device and how the invariants in conjunction with a theorem prover were used to prove formally that the device satis es a set of critical security properties.
منابع مشابه
New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملStatic Analysis to Identify Invariants in RSML Specifications
Static analysis of formal, high-level specifications of safety critical software can discover flaws in the specification that would escape conventional syntactic and semantic analysis. As an example, specifications written in the Requirements State Machine Language (RSML) should be checked for consistency: two transitions out of the same state that are triggered by the same event should have mu...
متن کاملA Strategy for Efficiently Verifying Requirements Specifications Using Composition and Invariants
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker or a theorem prover, uses known state invariants to prove state and transition invariants. Two proof rules are presented: a standard incremental proof rule analogous to Manna and Pnueli’s incremental proof rule and a c...
متن کاملAutomatic Generation of State Invariants
Automatic generation of state invariants, properties that hold in every reachable state of a state machine model, can be valuable in software development. Not only can such invariants be presented to system users for validation, in addition, they can be used as auxiliary assertions in proving other invariants. This paper describes an algorithm for the automatic generation of state invariants th...
متن کاملUsage of Invariants for Symbolic Verification of Requirements
The main goal of the paper is finding of preand post-invariants for transitions between symbolic states in the system that must be verified and use them for verification purposes. Systems are specified by basic protocols [1]. This specification defines a transition system with transitions s → s′ where s and s′ are symbolic states, b is a basic protocol. The main problem of verification is a rea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001